Date: Tue, 05 Nov 1996 00:33:28 GMT
Server: NCSA/1.5
Content-type: text/html
Last-modified: Thu, 31 Oct 1996 21:11:31 GMT
Content-length: 56505

<!DOCTYPE HTML PUBLIC "-//IETF//DTD HTML 2.0//EN">
<!--Converted with LaTeX2HTML 96.1 (Feb 5, 1996) by Nikos Drakos (nikos@cbl.leeds.ac.uk), CBLU, University of Leeds -->
<HTML>
<HEAD>
<TITLE>Computer Sciences Courses</TITLE>
<META NAME="description" CONTENT="Computer Sciences Courses">
<META NAME="keywords" CONTENT="grad-guidebook">
<META NAME="resource-type" CONTENT="document">
<META NAME="distribution" CONTENT="global">
<LINK REL=STYLESHEET HREF="grad-guidebook.css">
</HEAD>
<BODY LANG="EN">
 <H1><A NAME="SECTION00090000000000000000">Computer Sciences Courses</A></H1>
<P>
<H2><A NAME="SECTION00091000000000000000">General Information about Courses</A></H2>
<P>
Courses numbered 399 and below may be taken for undergraduate credit only.
Courses numbered 400 through 699 may be taken by either undergraduate or
graduate students.  Courses numbered 700 or above are intended only for
graduate students.  Undergraduates are allowed to take courses numbered 700 or
above, but only if permission is obtained from the dean's office.
<P>
Courses offered less than once every two years are marked as ``infrequently
offered;'' students should not count on taking these classes when planning
their schedules.  
<!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><A NAME="tex2html25" HREF="http://www.cs.wisc.edu/~bobh/timetable">Tentative timetables for upcoming semesters</A>
are available.
<P>
World-Wide Web pages for the 
<!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><A NAME="tex2html26" HREF="http://www.cs.wisc.edu/directories/classes.html">current semester's offerings</A>
of many Computer Sciences courses are available.
Additional information about many cross-listed courses
can be found via the 
<!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><A NAME="tex2html27" HREF="http://www.engr.wisc.edu/">College of Engineering's</A>
and the
<!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><A NAME="tex2html28" HREF="http://math.wisc.edu/courses/">Department of Mathematics'</A>
WWW home pages.
<P>
<A NAME="cs110">&#160;</A>
<!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><A NAME="tex2html29" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION00092000000000000000">110 Introduction to Computer Programming 1 cr.</A></H2>
<P>
This course is designed to give engineering students an introduction to a
computer programming language, such as Fortran or C. It will cover elementary
concepts such as variable type, control structures, loops, and arrays.
Prereq:&nbsp;Advanced high school mathematics.  Open to Fr.
<A NAME="cs132">&#160;</A>
<!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><A NAME="tex2html30" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION00093000000000000000">132 Using Computers 4 cr.</A></H2>
<P>
Introduction to use of computers. Some programs in Basic, but emphasis on
productivity tools such as word processing, spreadsheets, graphics, and
telecommunications.  Consideration of societal impacts of computers.  Not
intended for Computer Sciences majors.  Prereq:&nbsp;Minimum mathematical
competency (two years of high school math).  Open to Fr.
<A NAME="cs302">&#160;</A>
<!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><A NAME="tex2html31" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION00094000000000000000">302 Algebraic Language Programming 3 cr.</A></H2>
<P>
Construction of algorithms; problem solving; instruction and experience in the
use of at least one procedure-oriented language (e.g., Pascal or Fortran);
survey of other such languages, advanced programming techniques.  
Prereq:&nbsp;Advanced high school mathematical preparation or some college work in
mathematics, statistics or logic; or consent of instructor.  Open to Fr.
<A NAME="cs310">&#160;</A>
<!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><A NAME="tex2html32" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION00095000000000000000">310 Problem Solving using Computers 3 cr.</A></H2>
<P>
Gives engineering students an introduction to computer and analytical skills to
use in their subsequent course work and professional development. Discusses
several methods of using computers to solve problems, including elementary
Fortran and C programming techniques, the use of spreadsheets, symbolic
manipulation languages, and software packages. Techniques will be illustrated
using sample problems drawn from elementary engineering. Emphasis on
introduction of algorithms with the use of specific tools to illustrate the
methods.
Prereq:&nbsp;Math&nbsp;222 and an elementary knowledge of Fortran or C or Pascal.
<A NAME="cs352">&#160;</A>
<H2><A NAME="SECTION00096000000000000000">352 <!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><A NAME="tex2html33" HREF="http://www.cs.wisc.edu/~arch/uwarch/courses/cs352.html">Digital Systems Fundamentals</A> 4 cr. <!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><A NAME="tex2html34" HREF="http://www.engr.wisc.edu/ece/courses/ece352.html">(also ECE)</A></A></H2>
<P>
Logic components, Boolean algebra, combinational logic analysis and synthesis,
synchronous and asynchronous sequential logic analysis and design, digital
subsystems, computer organization and design.  Prereq:&nbsp;<!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs302">CS&nbsp;302</A> or
equivalent. Not open to students with EGR classification.
<A NAME="cs354">&#160;</A>
<H2><A NAME="SECTION00097000000000000000">354 <!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><A NAME="tex2html35" HREF="http://www.cs.wisc.edu/~arch/uwarch/courses/cs354.html">Machine Organization and Basic Systems</A> 4 cr. <!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><A NAME="tex2html36" HREF="http://www.engr.wisc.edu/ece/courses/ece354.html">(also ECE)</A></A></H2>
<P>
An introduction to current system structures of control, communication,
memories, processors and I-O devices.  Projects involve detailed study and use
of a specific small computer hardware and software system.  Prereq:&nbsp;<!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs302">CS&nbsp;302</A> or
consent of instructor.  Open to Fr.
<A NAME="cs364">&#160;</A>
<!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><A NAME="tex2html37" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION00098000000000000000">364 Introduction to Database Management Systems 3 cr.</A></H2>
<P>
Design, use, and application of database management systems.  Role of a database
management system as a corporate decision-making tool.  The Entity-Relationship
and Relational data models for database design.  File structures, data
independence, integrity, privacy, security, application development, and the
role of the database administrator.  Students use several database management
systems.  Students may not receive credit for both CS&nbsp;364 and&nbsp;<!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs564">564</A>.
Prereq:&nbsp;<!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs302">CS&nbsp;302</A> or consent of instructor.
<A NAME="cs367">&#160;</A>
<!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><!WA17><A NAME="tex2html38" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION00099000000000000000">367 Introduction to Data Structures 3 cr.</A></H2>
<P>
Study of data structures - specification, application and implementation.
Stacks, queues, trees and other important structures.  Application to garbage
collection, dynamic storage allocation, sorting and searching, symbol tables,
and arithmetic expressions.  Emphasis on development and analysis of efficient
algorithms, including use of structured programming methodology.
Prereq:&nbsp;<!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><!WA18><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs302">CS&nbsp;302</A>; Pascal or equivalent.
<A NAME="cs371">&#160;</A>
<!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><!WA19><A NAME="tex2html39" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000910000000000000000">371 Technology of Computer-Based Business Systems 3 cr. (also BUS)</A></H2>
<P>
Overview of computers, their attendant technology, and the implications of
this technology for large-scale, computer-based information systems.  Topics
include hardware, system software, program development, files, and data
communications.  Prereq:&nbsp;Bus&nbsp;370 and <!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><!WA20><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>, or equivalent
experience with consent of instructor.
<A NAME="cs412">&#160;</A>
<!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><!WA21><A NAME="tex2html40" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000911000000000000000">412 Introduction to Numerical Methods 3 cr.</A></H2>
<P>
Interpolation, solution of linear and nonlinear systems of equations,
approximate integration and differentiation, numerical solution of ordinary
differential equations.  Prereq:&nbsp;Math&nbsp;223,
<!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><!WA22><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs302">CS&nbsp;302</A>, or equivalent and knowledge of matrix algebra. 
<A NAME="cs425">&#160;</A>
<!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><!WA23><A NAME="tex2html41" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000912000000000000000">425 Introduction to Combinatorial Optimization 3 cr. (also Math &amp; IE)</A></H2>
<P>
Exact and heuristic methods for key combinatorial optimization problems such
as: shortest path, maximum flow problems, and the traveling salesman problem.
Techniques include problem-specific methods and general approaches such as
branch-and-bound, genetic algorithms, simulated annealing, and neural
networks. Prereq:&nbsp;Math&nbsp;221 or <!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><!WA24><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs302">CS&nbsp;302</A> or consent of instructor.
<A NAME="cs458">&#160;</A>
<!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><!WA25><A NAME="tex2html42" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000913000000000000000">458 Computer Graphics 3 cr. 
<!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><!WA26><A NAME="tex2html43" HREF="http://www.engr.wisc.edu/me/courses/me458.html">(also ME</A> &amp; <!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><!WA27><A NAME="tex2html44" HREF="http://www.engr.wisc.edu/ece/courses/ece458.html">ECE)</A></A></H2>
<P>
Principles of computational geometry and computer graphics and their
application; homogeneous coordinates, projective geometry, 3-D curve and
surface representations; data structures and geometric databases, wire-frame
and solid geometric representations; graphic I/O device characteristics and
cost considerations.  Programming exercises and projects based on
applications.  Prereq:&nbsp;<!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><!WA28><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs302">CS&nbsp;302</A> and Math&nbsp;320 or&nbsp;340, or consent of instructor.
<A NAME="cs460">&#160;</A>
<!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><!WA29><A NAME="tex2html45" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000914000000000000000">460 Artificial Intelligence Programming Languages and Tools 3 cr.</A></H2>
<P>
Symbolic computation; Lisp programming; Prolog programming; knowledge
representation languages based on logic, objects, frames, rules; symbolic
pattern matching; automatic inferencing and reasoning techniques;
special-purpose languages and computer architectures for artificial
intelligence applications.  Prereq:&nbsp;<!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><!WA30><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>.
(Infrequently offered.)
<A NAME="cs475">&#160;</A>
<!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><!WA31><A NAME="tex2html46" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000915000000000000000">475 Introduction to Combinatorics 3 cr. (also Math&nbsp;&amp; Stat)</A></H2>
<P>
Problems of enumeration, distribution and arrangement.  Inclusion-exclusion
principle.  Generating functions and linear recurrence relations.
Combinatorial identities.  Graph coloring problems.  Finite designs.  Systems
of distinct representatives and matching problems in graphs.  Potential
applications in the social, biological, and physical sciences.  Puzzles.
Emphasis on problem solving.  Prereq:&nbsp;Math&nbsp;320 or 340 and consent of
instructor.
<A NAME="cs509">&#160;</A>
<!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><!WA32><A NAME="tex2html47" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000916000000000000000">509 Mathematics for Computer Science 3 cr.</A></H2>
<P>
Program correctness and termination, invariants, pre- and post-conditions,
axiomatic semantics.  Representing time and space requirements of programs by
summations, recurrences, and generating functions.  Exact and asymptotic
solutions.  Analysis of algorithms for sorting, searching, and data structure
traversal.  Prereq:&nbsp;<!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><!WA33><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A> and Math&nbsp;222, or consent of instructor.
(Infrequently offered.)
<A NAME="cs513">&#160;</A>
<!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><!WA34><A NAME="tex2html48" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000917000000000000000">513 Numerical Linear Algebra 3 cr. (also Math)</A></H2>
<P>
Direct and iterative solution of linear and nonlinear systems and of
eigenproblems.  LU and symmetric LU factorization.  Complexity, stability, and
conditioning.  Nonlinear systems. Iterative methods for linear
systems. QR-factorization and least squares. Eigenproblems: local and global
methods.  Prereq:&nbsp;Math&nbsp;340 or equivalent; <!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><!WA35><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs302">CS&nbsp;302</A> or equivalent.
<A NAME="cs514">&#160;</A>
<!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><!WA36><A NAME="tex2html49" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000918000000000000000">514 Numerical Analysis 3 cr. (also Math)</A></H2>
<P>
Polynomial forms, divided differences.  Polynomial interpolation.  Polynomial
approximation: uniform approximation and Chebyshev polynomials, least-squares
approximation and orthogonal polynomials.  Splines, B-splines and spline
approximation.  Numerical differentiation and integration.  Numerical methods
for solving initial and boundary value problems for ordinary differential
equations.  Prereq:&nbsp;Math&nbsp;340 or equivalent; <!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><!WA37><A HREF="#cs320">CS&nbsp;302</A> or equivalent.
<A NAME="cs520">&#160;</A>
<!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><!WA38><A NAME="tex2html50" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000919000000000000000">520 Introduction to Theoretical Computer Science 3 cr.</A></H2>
<P>
Survey of the basic concepts of theory, including context-free and
context-sensitive languages, regular sets, finite and pushdown automata,
Turing machines, undecidable problems, complexity with respect to time and
space, NP-completeness, and reducibilities.  Prereq:&nbsp;<!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><!WA39><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A> and Math&nbsp;222, or
consent of instructor.
<A NAME="cs525">&#160;</A>
<H2><A NAME="SECTION000920000000000000000">525 <!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><!WA40><A NAME="tex2html51" HREF="http://www.cs.wisc.edu/~ferris/cs525-all.html">Linear Programming Methods</A> 3 cr. (also IE, Math, &amp; Stat)</A></H2>
<P>
Real linear algebra over polyhedral cones, theorems of the alternative for
matrices.  Formulation of linear programs.  Duality theory and solvability.
The simplex method and related methods for efficient computer solution.
Perturbation and sensitivity analysis.  Applications and extensions, such as
game theory, linear economic models and quadratic programming.  
Prereq:&nbsp;Math&nbsp;443 or 320 or 340 or consent of instructor.
<A NAME="cs526">&#160;</A>
<!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><!WA41><A NAME="tex2html52" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000921000000000000000">526 Advanced Linear Programming 4 cr. ugrad, 3 cr. grad (also IE)</A></H2>
<P>
Review of linear programming. Polynomial time methods for linear
programming. Quadratic programs and linear complementarity problems and
related solution techniques. Solution sets and their continuity
properties. Error bounds for linear inequalities and programs. Parallel
algorithms for linear and quadratic programs.  Prereq:&nbsp;<!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><!WA42><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs525">CS&nbsp;525</A> or equivalent,
<!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><!WA43><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs302">CS&nbsp;302</A> or equivalent, or consent of instructor.
(Infrequently offered.)
<A NAME="cs532">&#160;</A>
<!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><!WA44><A NAME="tex2html53" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000922000000000000000">532 Theory and Applications of Pattern Recognition 3 cr. 
<!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><!WA45><A NAME="tex2html54" HREF="http://www.engr.wisc.edu/ece/courses/ece532.html">(also ECE</A> &amp; <!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><!WA46><A NAME="tex2html55" HREF="http://www.engr.wisc.edu/me/courses/me532.html">ME)</A></A></H2>
<P>
Pattern recognition systems and components; decision theories and
classification; discriminant functions; supervised and unsupervised training;
clustering; feature extraction and dimensional reduction; sequential and
hierarchical classification; applications of training, feature extraction, and
decision rules to engineering problems.  Prereq:&nbsp;ECE 430 or Math&nbsp;431 or
consent of instructor.
<A NAME="cs533">&#160;</A>
<!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><!WA47><A NAME="tex2html56" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000923000000000000000">533 Image Processing 3 cr. 
<!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><!WA48><A NAME="tex2html57" HREF="http://www.engr.wisc.edu/ece/courses/ece533.html">(also ECE)</A></A></H2>
<P>
Mathematical representation of continuous and digital images; models of image
degradation; picture enhancement, restoration, segmentation, and coding;
pattern recognition, tomography.  Prereq:&nbsp;ECE 330 and&nbsp;333 or consent of
instructor.
<A NAME="cs536">&#160;</A>
<!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><!WA49><A NAME="tex2html58" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000924000000000000000">536 Introduction to Programming Languages and Compilers<BR>4 cr. ugrad, 3 cr. grad.</A></H2>
<P>
Introduction to the theory and practice of compiler design.  Comparison of
features of several programming languages and their implications for
implementation techniques.  Several programming projects required.  
Prereq:&nbsp;<!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><!WA50><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A> and either <!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><!WA51><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs354">CS&nbsp;354</A> 
or&nbsp;<!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><!WA52><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs552">552</A>.
<A NAME="cs537">&#160;</A>
<!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><!WA53><A NAME="tex2html59" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000925000000000000000">537 Introduction to Operating Systems 4 cr. ugrad, 3 cr. grad.</A></H2>
<P>
Input-output hardware, interrupt handling, properties of magnetic tapes, discs
and drums, associative memories and virtual address translation techniques.
Batch processing, time sharing and real-time systems, scheduling resource
allocation, modular software systems, performance measurement and system
evaluation.  Prereq:&nbsp;<!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><!WA54><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A> and&nbsp;<!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><!WA55><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs354">354</A>.
<A NAME="cs538">&#160;</A>
<!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><!WA56><A NAME="tex2html60" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000926000000000000000">538 Introduction to the Theory and Design of Programming Languages 3 cr.</A></H2>
<P>
Design and theory of programming languages: procedural, object-oriented,
functional and logic paradigms.  Serial and concurrent programming.  Execution
models and formal specification techniques.  Prereq:&nbsp;<!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><!WA57><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs354">CS&nbsp;354</A>
and&nbsp;<!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><!WA58><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">367</A>.
<A NAME="cs540">&#160;</A>
<H2><A NAME="SECTION000927000000000000000">540 <!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><!WA59><A NAME="tex2html61" HREF="http://www.cs.wisc.edu/~shavlik/cs540-all.html">Introduction to Artificial Intelligence</A> 4 cr. ugrad, 3 cr. grad.</A></H2>
<P>
Principles of knowledge-based search techniques; automatic deduction;
knowledge representation using predicate logic, semantic networks,
connectionist networks, frames, rules; Applications in problem solving, expert
systems, game playing, vision, natural language understanding, learning,
robotics; Lisp programming.  Prereq:&nbsp;<!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><!WA60><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>.
<A NAME="cs545">&#160;</A>
<!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><!WA61><A NAME="tex2html62" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000928000000000000000">545 Natural Language and the Computer 3 cr.</A></H2>
<P>
The course covers basic techniques and tools in natural language processing:
generative grammars, parsing, dictionary construction, semantic networks,
generation of text from a knowledge base, natural language interfaces, and
machine translation.  Prereq:&nbsp;<!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><!WA62><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs536">CS&nbsp;536</A> or&nbsp;<!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><!WA63><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs537">537</A>
or&nbsp;<!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><!WA64><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs564">564</A> or consent of instructor.
<A NAME="cs547">&#160;</A>
<!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><!WA65><A NAME="tex2html63" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000929000000000000000">547 Computer Systems Modeling Fundamentals 3 cr.</A></H2>
<P>
An introduction to basic tools and applications for modeling and analysis of
computer systems.  Fundamentals of network flow graphs, graph models of
computation and stochastic models of computer system performance.  Network
delay analysis and capacity planning, reachability analysis for deadlock
detection in distributed systems, Markov chains, elementary queueing theory,
basic concepts of queueing network models and associated analyses.  
Prereq:&nbsp;Math&nbsp;223, <!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><!WA66><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A> and&nbsp;<!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><!WA67><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs354">354</A>.
<A NAME="cs550">&#160;</A>
<!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><!WA68><A NAME="tex2html64" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000930000000000000000">550 Computers and Society 3 cr. (also Social Studies)</A></H2>
<P>
The effect of scientific and technological change on social and economic
organization.  Historical examples.  Comparison, with these examples, of the
computer and its effect.  Consideration of possible uses of computer systems,
social change which they would influence, and the choices they present.
Prereq:&nbsp;Junior standing.
(Infrequently offered.)
<A NAME="cs552">&#160;</A>
<H2><A NAME="SECTION000931000000000000000">552 <!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><!WA69><A NAME="tex2html65" HREF="http://www.cs.wisc.edu/~arch/uwarch/courses/cs552.html">Introduction to Computer Architecture</A> 3 cr.</A></H2>
<P>
The design of computer systems and components.  Processor design, instruction
set design, and addressing; control structures and microprogramming; memory
management, caches, and memory hierarchies; interrupts and I/O structures.
Prereq:&nbsp;<!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><!WA70><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs352">ECE/CS&nbsp;352</A> and <!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><!WA71><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs354">CS/ECE&nbsp;354</A>;
co-req:&nbsp;<!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><!WA72><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>.
<A NAME="cs558">&#160;</A>
<H2><A NAME="SECTION000932000000000000000">558 <!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><!WA73><A NAME="tex2html66" HREF="http://sal-cnc.me.wisc.edu/558.html">Introduction to Computational Geometry</A> 3 cr. (also ME and IE)</A></H2>
<P>
Introduction to fundamental geometric computations and algorithms, and their
use for solving engineering and scientific problems.  Computer representations
of simple geometric objects and paradigms for algorithm design.  Applications
from areas of engineering analysis, design and manufacturing, biology,
statistics, and other sciences.
Prereq:&nbsp;<!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><!WA74><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A> or equivalent, 
Math 223 or equivalent, or consent of instructor.
<A NAME="cs562">&#160;</A>
<!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><!WA75><A NAME="tex2html67" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000933000000000000000">562 Expert Systems: Design and Implementation 3 cr.</A></H2>
<P>
Design of expert knowledge bases: choice of appropriate representation,
knowledge base structure, connection with databases.  Knowledge acquisition:
possible knowledge sources, logical analysis and formalization, consistency
and adequate checking.  Inference engine construction and tailoring: choice
and control of inferencing strategies, handling uncertain knowledge, achieving
efficiency.  Display and dialog design.  Implementation of explanation
capabilities.  Evaluation of knowledge engineering environments and languages.
Prereq:&nbsp;<!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><!WA76><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs460">CS&nbsp;460</A> or&nbsp;<!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><!WA77><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs540">540</A>.
(Infrequently offered.)
<A NAME="cs564">&#160;</A>
<!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><!WA78><A NAME="tex2html68" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000934000000000000000">564 Database Management Systems: Design and Implementation<BR>4 cr. ugrad, 3 cr. grad.</A></H2>
<P>
What a database management system is; different data models currently used to
structure the logical view of the database: relational, hierarchical, and
network.  Hands-on experience with relational and network-based database
systems.  Implementation techniques for database systems.  File organization,
query processing, concurrency control, rollback and recovery, integrity and
consistency, and view implementation.  Prereq:&nbsp;<!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><!WA79><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>
and&nbsp;<!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><!WA80><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs354">354</A>.
<A NAME="cs577">&#160;</A>
<!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><!WA81><A NAME="tex2html69" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000935000000000000000">577 Introduction to Algorithms 3 cr.</A></H2>
<P>
Survey of important and useful algorithms for sorting, searching,
pattern-matching, graph manipulation, geometry, and cryptography.  Paradigms
for algorithm design. Techniques for efficient implementation.  Prereq:&nbsp;<!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><!WA82><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>
and Math&nbsp;222, or consent of instructor.
<A NAME="cs638">&#160;</A>
<!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><!WA83><A NAME="tex2html70" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000936000000000000000">638 Undergraduate Topics in Computing 3 cr.</A></H2>
<P>
Prereq:&nbsp;Consent of instructor.
<A NAME="cs640">&#160;</A>
<!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><!WA84><A NAME="tex2html71" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000937000000000000000">640 Introduction to Computer Networks 3 cr.</A></H2>
<P>
Architecture and components of computer communications networks; protocol
concepts and standards; OSI Reference Model; network/protocol architecture
examples: Internet, ISO/CCITT, SNA, DECNET, public data networks;
local area networks-gateways, internetworking, transport and application
protocols.  Prereq:&nbsp;<!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><!WA85><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs537">CS&nbsp;537</A>.
<A NAME="cs681">&#160;</A><A NAME="cs682">&#160;</A>
<!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><!WA86><A NAME="tex2html72" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000938000000000000000">681-682 Senior Honors Thesis 3 cr. per sem.</A></H2>
<P>
Prereq:&nbsp;Honors candidacy and consent of instructor.
<A NAME="cs691">&#160;</A><A NAME="cs692">&#160;</A>
<!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><!WA87><A NAME="tex2html73" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000939000000000000000">691-692 Senior Thesis 2-3 cr. per sem.</A></H2>
<P>
(A year's course must be taken to get credit.)  Prereq:&nbsp;Consent of instructor.
<A NAME="cs699">&#160;</A>
<!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><!WA88><A NAME="tex2html74" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000940000000000000000">699 Directed Study 1-6 cr.</A></H2>
<P>
Prereq:&nbsp;Junior or senior standing and consent of instructor.
<A NAME="cs701">&#160;</A>
<!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><!WA89><A NAME="tex2html75" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000941000000000000000">701 Programming Languages and Compilers 3 cr.</A></H2>
<P>
Design and implementation of compilers for modern programming languages.
Emphasis on tools for compiler construction.  Prereq:&nbsp;<!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><!WA90><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs536">CS&nbsp;536</A>.
<A NAME="cs702">&#160;</A>
<!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><!WA91><A NAME="tex2html76" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000942000000000000000">702 Compiler Construction 3 cr.</A></H2>
<P>
Techniques for the implementation of compilers for sophisticated programming
languages.  Prereq:&nbsp;<!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><!WA92><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs536">CS&nbsp;536</A>; co-req: <!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><!WA93><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs701">CS&nbsp;701</A>
or consent of instructor.  (Infrequently offered.)
<A NAME="cs703">&#160;</A>
<!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><!WA94><A NAME="tex2html77" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000943000000000000000">703 Advanced Topics in Programming Languages and Compilers 3 cr.</A></H2>
<P>
Advanced topics in compiling and programming languages design.  Advanced
parsing techniques; automatic syntactic error correction; local and global
code optimization; attribute grammars; programming language design issues
(data and control abstractions, specification and verification of high level
languages).  Prereq:&nbsp;<!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><!WA95><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs701">CS&nbsp;701</A>.
<A NAME="cs704">&#160;</A>
<!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><!WA96><A NAME="tex2html78" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000944000000000000000">704 Principles of Programming Languages  3 cr.</A></H2>
<P>
Introduction to principles of advanced programming languages and
programming-language theory.  Topics include: lambda-calculus, functional
languages, polymorphic functions, type inference, structural induction, lazy
evaluation, operational semantics, denotational semantics, and axiomatic
semantics.  Prereq:&nbsp;<!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><!WA97><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs536">CS&nbsp;536</A> or consent of instructor.
<A NAME="cs709">&#160;</A>
<!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><!WA98><A NAME="tex2html79" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000945000000000000000">709 Mathematical Techniques for Analysis of Algorithms 3 cr.</A></H2>
<P>
Techniques for quantitative analysis of algorithms.  Charging arguments,
amortization, probabilistic methods.  Adversary and information lower bounds.
Use of methods from combinatorics, complex analysis, and asymptotics in
obtaining precise analyses of quicksort, chained hashing, and other
algorithms.  Prereq:&nbsp;<!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><!WA99><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs577">CS&nbsp;577</A>, knowledge of complex variables at the level of
Math&nbsp;321.
(Infrequently offered.)
<A NAME="cs712">&#160;</A>
<!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><!WA100><A NAME="tex2html80" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000946000000000000000">712 Finite Difference Methods 3 cr.</A></H2>
<P>
Development of finite difference methods for initial and boundary value
problems for hyperbolic, parabolic, and elliptic partial differential
equations.  Analysis of accuracy and stability of difference schemes.  Direct
and iterative methods for solving elliptic difference schemes.  Applications
from science and engineering.  Prereq:&nbsp;<!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><!WA101><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs302">CS&nbsp;302</A>,
<!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><!WA102><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs412">412</A>, Math&nbsp;419 or equivalent, or consent of instructor.
<A NAME="cs713">&#160;</A>
<!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><!WA103><A NAME="tex2html81" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000947000000000000000">713 Numerical Analysis of Differential Equations 3 cr.</A></H2>
<P>
Analysis of numerical methods for ordinary differential equations.  Single
step and multistep methods.  Stiff equations.  Introduction to Galerkin
methods; collocation, least squares, etc.  Analysis of methods for the
solution of large sparse systems of boundary value problems. Prereq:&nbsp;Graduate
standing and consent of instructor.
<A NAME="cs717">&#160;</A><A NAME="cs718">&#160;</A>
<H2><A NAME="SECTION000948000000000000000">717(-718) <!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><!WA104><A NAME="tex2html82" HREF="http://www.cs.wisc.edu/~deboor/cs717.html">Numerical Functional Analysis</A> 3 cr. per sem. (also Math)</A></H2>
<P>
Fundamentals of normed spaces and linear operators; analysis of nonlinear
operators; existence of, and iterative methods for, solutions of linear and
nonlinear operator equations, error estimation; variational theory and
minimization problems; monotonicity theory.  Development of abstract tools and
application of them to the general analysis of numerical methods for such
problems as differential and integral equations.
Prereq:&nbsp;<!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><!WA105><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs513">CS&nbsp;513</A>, <!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><!WA106><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs514">514</A> and Math&nbsp;223 or consent
of instructor.  (CS&nbsp;718 is infrequently offered.)
<A NAME="cs719">&#160;</A>
<H2><A NAME="SECTION000949000000000000000">719 <!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><!WA107><A NAME="tex2html83" HREF="http://www.cs.wisc.edu/~ferris/cs719.html">Network Flows</A> 3 cr. (also IE)</A></H2>
<P>
Optimization problems and techniques for networks, including single and
multi-commodity network flow, critical path, and facilities location problems.
The theory of totally unimodular matrices and its relationship to network
optimization.  Prereq:&nbsp;<!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><!WA108><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs525">CS&nbsp;525</A> or consent of instructor.
<A NAME="cs720">&#160;</A>
<!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><!WA109><A NAME="tex2html84" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000950000000000000000">720 Integer Programming 3 cr. (also IE)</A></H2>
<P>
Formulation of integer programming problems and the characterization of
optimization problems representable as integer and mixed-integer programs.
The degree of difficulty of classes of integer programs and its relation to
the structure of their feasible sets.  Optimality conditions.
Branch-and-bound, cutting plane, and decomposition methods for obtaining
solutions or approximating solutions. Prereq:&nbsp;<!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><!WA110><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs525">CS&nbsp;525</A> or consent of instructor.
<A NAME="cs723">&#160;</A>
<!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><!WA111><A NAME="tex2html85" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000951000000000000000">723 Dynamic Programming and Associated Topics 3 cr. (also IE)</A></H2>
<P>
A generalized optimization model; discrete and continuous state spaces;
deterministic and stochastic transition functions.  Multistage decision
processes.  Functional equations and successive approximation in function and
policy spaces.  Relationship to linear programming and acyclic networks.
Markovian decision processes.  Solution methods and computational problems.
Associated topics and applications such as calculus of variations; feedback
control processes; and optimal trajectories, inventory and maintenance
policies, and stopping rules.  Prereq:&nbsp;<!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><!WA112><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs525">CS&nbsp;525</A> or IE&nbsp;623;
Math&nbsp;521 or <!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><!WA113><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs726">CS&nbsp;726</A>; Math&nbsp;431 and computer programming, or
consent of instructor.  (Infrequently offered.)
<A NAME="cs726">&#160;</A>
<H2><A NAME="SECTION000952000000000000000">726 <!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><!WA114><A NAME="tex2html86" HREF="http://www.cs.wisc.edu/~ferris/cs726-all.html">Nonlinear Programming Theory and Applications</A> 3 cr. (also IE &amp; Stat)</A></H2>
<P>
Separation theorems and other properties of convex sets in finite-dimensional
spaces.  Formulation of nonlinear programming problems.  Saddle-point
(Lagrangian) optimality criteria for convex nonlinear programs.  Duality
theorems for convex programs.  First, and second-order Kuhn-Tucker
stationary-point theory for differentiable non-convex programs.  Perturbation
and sensitivity analysis.  Applications and extensions.  Prereq:&nbsp;Familiarity
with basic mathematical analysis (e.g., Math&nbsp;521) and either Math.&nbsp;443 or&nbsp;320,
or consent of instructor.
<A NAME="cs727">&#160;</A>
<!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><!WA115><A NAME="tex2html87" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000953000000000000000">727 Advanced Nonlinear Programming 3 cr. (also IE)</A></H2>
<P>
Conjugate convex functions and Fenchel-Rockafellar duality. Monotone operators
and subdifferentials. Advanced methods for nonconvex problems, such as
variational principles, generalized gradients, degree and index arguments, and
multivalued ordinary differential equations. Applications to economics and
operations research.  Prereq:&nbsp;<!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><!WA116><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs726">CS&nbsp;726</A> or consent of instructor.
<A NAME="cs730">&#160;</A>
<H2><A NAME="SECTION000954000000000000000">730 <!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><!WA117><A NAME="tex2html88" HREF="http://www.cs.wisc.edu/~olvi/cs730.html">Nonlinear Programming Algorithms</A> 3 cr. (also IE)</A></H2>
<P>
Rigorous description, and convergence proofs of various nonlinear programming
algorithms.  Emphasis on algorithms that are important, can be proved to
converge and are practical.  Unification of classes of algorithms and
convergence rates.  Each student will code and test one of the algorithms
described in the course.  Prereq:&nbsp;Consent of instructor.
<A NAME="cs731">&#160;</A>
<!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><!WA118><A NAME="tex2html89" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000955000000000000000">731 Advanced Artificial Intelligence 3 cr.</A></H2>
<P>
Learning and hypothesis formation; knowledge acquisition; deductive and
inductive inference systems; reasoning techniques involving time, nonmonotonic
reasoning, spatial reasoning, truth maintenance systems; planning strategies.
Prereq:&nbsp;<!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><!WA119><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs540">CS&nbsp;540</A>.
(Infrequently offered.)
<A NAME="cs732">&#160;</A>
<!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><!WA120><A NAME="tex2html90" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000956000000000000000">732 Topics in Artificial Intelligence 3 cr.</A></H2>
<P>
Advanced topics in artificial intelligence.  A variable content course which
may be repeated any number of times for credit.  Prereq:&nbsp;Consent of
instructor.
(Infrequently offered.)
<A NAME="cs733">&#160;</A>
<H2><A NAME="SECTION000957000000000000000">733 <!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><!WA121><A NAME="tex2html91" HREF="http://www.cs.wisc.edu/~ferris/cs733.html">Computational Methods for Large Sparse Systems</A> <BR>3 cr. (also Math &amp; ECE)</A></H2>
<P>
Sparse matrices in engineering and science.  Sparsity preservation. Numerical
error control.  Transversal algorithms, Tarjan's algorithm, Tinney's
algorithms, minimum degree, banding, nested dissection, frontal methods.
Linear and nonlinear equation solving.  Compensation. Sparse vector methods.
Iterative methods. ODE and PDE applications.  Prereq:&nbsp;<!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><!WA122><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>
and&nbsp;<!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><!WA123><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs412">412</A>, or consent of instructor.
<A NAME="cs736">&#160;</A>
<!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><!WA124><A NAME="tex2html92" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000958000000000000000">736 Advanced Operating Systems 3 cr.</A></H2>
<P>
Advanced topics in operating systems, including process communication,
resource allocation, multiprocess and network operating systems, kernel
philosophies, fault-tolerant systems, virtual machines, high-level language
systems, verifiability and proof techniques.  Prereq:&nbsp;<!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><!WA125><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs537">CS&nbsp;537</A> or consent of
instructor.
<A NAME="cs737">&#160;</A>
<!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><!WA126><A NAME="tex2html93" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000959000000000000000">737 Computer System Performance Evaluation and Modeling 3 cr.</A></H2>
<P>
Statistical techniques of computer system performance evaluation and
measurement.  System selection and tuning strategies.  Deterministic and
probabilistic models of process scheduling and resource allocation.  Analytic
and simulation models of computer systems.  Systematic study of system
architectures. Prereq:&nbsp;Math&nbsp;222, <!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><!WA127><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs537">CS&nbsp;537</A>
or&nbsp;<!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><!WA128><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs736">736</A>, or consent of instructor.
<A NAME="cs739">&#160;</A>
<!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><!WA129><A NAME="tex2html94" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000960000000000000000">739 Distributed Systems 3 cr.</A></H2>
<P>
Basic concepts, distributed programming; distributed file systems; atomic
actions; fault tolerance, transactions, program &amp; data replication, recovery;
distributed machine architectures; security and authentication; load balancing
and process migration; distributed debugging; distributed performance
measurement; distributed simulation techniques; distributed applications;
correctness considerations and proof systems.  Prereq:&nbsp;<!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><!WA130><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs736">CS&nbsp;736</A> or consent of
instructor. (Infrequently offered.)
<A NAME="cs740">&#160;</A>
<!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><!WA131><A NAME="tex2html95" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000961000000000000000">740 Advanced Computer Networks 3 cr.</A></H2>
<P>
Advanced topics in computer communications networks: Congestion and flow
control; Routing; Rate-based protocols; High-speed interfaces and
technologies; Metropolitan area networks; Fast packet switching technologies;
Advanced applications; Network services: name service, authentication,
resource location. Prereq:&nbsp;<!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><!WA132><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs640">CS&nbsp;640</A>.
<A NAME="cs747">&#160;</A>
<!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><!WA133><A NAME="tex2html96" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000962000000000000000">747 Advanced Computer Systems Analysis Techniques 3 cr.</A></H2>
<P>
Advanced analytical modeling techniques for performance analysis of computer
systems, including discrete-parameter (embedded) Markov Chains, M/G/1 queues,
stochastic Petri nets, queueing networks, renewal theory, and sample path
analysis.  Application areas include high performance computer architectures,
databases, and operating system resource allocation policies.  Prereq:&nbsp;<!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><!WA134><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs547">CS&nbsp;547</A>
or consent of instructor.
<A NAME="cs750">&#160;</A>
<!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><!WA135><A NAME="tex2html97" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000963000000000000000">750 Real-Time Computing Systems 3cr. (also ECE)</A></H2>
<P>
Introduction to the unique issues in the design and analysis of computer
systems for real-time applications.  Hardware and software support for
guaranteeing timeliness with and without failures.  Resource management,
time-constrained communication, scheduling and imprecise computations,
real-time kernels and case studies. Prereq:&nbsp;<!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><!WA136><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs552">CS&nbsp;552</A>
and&nbsp;<!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><!WA137><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs537">537</A> or consent of instructor.
<A NAME="cs752">&#160;</A>
<H2><A NAME="SECTION000964000000000000000">752 <!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><!WA138><A NAME="tex2html98" HREF="http://www.cs.wisc.edu/~arch/uwarch/courses/cs752.html">Advanced Computer Architecture</A> 3 cr. (also ECE)</A></H2>
<P>
Advanced techniques of computer design.  Parallel processing and pipelining;
multiprocessors, multi-computers and networks; high performance machines and
special purpose processors; data flow architecture.  Prereq:&nbsp;<!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><!WA139><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs552">ECE/CS&nbsp;552</A> and
<!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><!WA140><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs537">CS&nbsp;537</A>.
<A NAME="cs755">&#160;</A>
<H2><A NAME="SECTION000965000000000000000">755 <!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><!WA141><A NAME="tex2html99" HREF="http://www.cs.wisc.edu/~arch/uwarch/courses/cs755.html">VLSI Systems Design</A> 3 cr. (also ECE)</A></H2>
<P>
Overview of MOS devices and circuits; introduction to integrated circuit
fabrication; topological design of data flow and control; interactive graphics
layout; circuit simulation; system timing; organizational and architectural
considerations; alternative implementation approaches; design project.
Prereq:&nbsp;ECE&nbsp;340, <!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><!WA142><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs352">ECE/CS&nbsp;352</A>, and <!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><!WA143><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs552">CS/ECE&nbsp;552</A>
or consent of instructor.
<A NAME="cs756">&#160;</A>
<H2><A NAME="SECTION000966000000000000000">756 <!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><!WA144><A NAME="tex2html100" HREF="http://www.cs.wisc.edu/~arch/uwarch/courses/cs756.html">Computer-Aided Design for VLSI</A> 3 cr. (also ECE)</A></H2>
<P>
Broad introduction to computer-aided design tools for VLSI, emphasizing
implementation algorithms and data structures.  Topics covered: design styles,
layout editors, symbolic compaction, module generators, placement and routing,
automatic synthesis, design-rule checking, circuit extraction, simulation and
verification.  Prereq:&nbsp;<!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><!WA145><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>, good programming skills,
<!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><!WA146><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs352">CS&nbsp;352</A>; <!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><!WA147><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs755">CS&nbsp;755</A> strongly recommended.
(Infrequently offered.)
<A NAME="cs757">&#160;</A>
<H2><A NAME="SECTION000967000000000000000">757 <!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><!WA148><A NAME="tex2html101" HREF="http://www.cs.wisc.edu/~arch/uwarch/courses/cs757.html">Advanced Computer Architecture</A> 3 cr. (also ECE)</A></H2>
<P>
Parallel algorithms, principles of parallelism detection and vectorizing
compilers, interconnection networks, SIMD/MIMD machines, processor
synchronization, data coherence, multis, dataflow machines, special purpose
processors.  Prereq:&nbsp;<!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><!WA149><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs752">CS&nbsp;752</A> or consent of instructor.
<A NAME="cs760">&#160;</A>
<H2><A NAME="SECTION000968000000000000000">760 <!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><!WA150><A NAME="tex2html102" HREF="http://www.cs.wisc.edu/~shavlik/cs760.html">Machine Learning</A> 3 cr.</A></H2>
<P>
Computational approaches to learning: including inductive inference,
explanation-based learning, analogical learning, connectionism, and formal
models.  What it means to learn.  Algorithms for learning.  Comparison and
evaluation of learning algorithms.  Cognitive modeling and relevant
psychological results. Prereq:&nbsp;<!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><!WA151><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs540">CS&nbsp;540</A>.
<A NAME="cs761">&#160;</A>
<H2><A NAME="SECTION000969000000000000000">761 <!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><!WA152><A NAME="tex2html103" HREF="http://www.cs.wisc.edu/~kunen/cs761.html">Deduction and Problem Solving by Computer</A> 3 cr.</A></H2>
<P>
Study and evaluation of programs that use automated deduction to solve
problems.  Variants of Prolog, such as constraint logic programming, parallel
prologs, and deductive database systems.  Resolution theorem provers.
Verification systems, such as the Boyer-Moore prover.
Prereq:&nbsp;<!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><!WA153><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs540">CS&nbsp;540</A>.
<A NAME="cs762">&#160;</A>
<!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><!WA154><A NAME="tex2html104" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000970000000000000000">762 Deduction and Problem Solving by Computer 3 cr.</A></H2>
<P>
Critical study and evaluation of programs and of man-computer interactive
systems that play games such as chess, bridge, and GO; solve problems and
puzzles; and prove theorems in various mathematical domains.  Different kinds
of languages, including natural language, usable for problem formulation and
for solution planning and testing.  Prereq:&nbsp;<!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><!WA155><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs540">CS&nbsp;540</A> or consent
of instructor.  (Infrequently offered.)
<A NAME="cs764">&#160;</A>
<!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><!WA156><A NAME="tex2html105" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000971000000000000000">764 Topics in Database Management Systems 3 cr.</A></H2>
<P>
Implementation of database management systems, the impact of new technology on
database management systems, back-end database computers, distributed database
management systems, concurrency control and query execution in both
distributed and centralized systems, implementation of multiple user views,
roll-back and recovery mechanisms, database translation.
Prereq:&nbsp;<!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><!WA157><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs564">CS&nbsp;564</A>, <!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><!WA158><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs537">537</A>,
and&nbsp;<!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><!WA159><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs536">536</A> or consent of instructor.
<A NAME="cs765">&#160;</A>
<!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><!WA160><A NAME="tex2html106" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000972000000000000000">765 Perceptual Recognition 3 cr.</A></H2>
<P>
High-level perceptual processing by computer; recognition of complex objects
and scenes; advanced computer vision systems; relation to the living visual
system; algorithm-structured multi-computer architectures for perception;
binocular and multi-modal vision; recognition and tracking of moving objects;
learning in perceptual systems; perceptual-motor control of robots.  
Prereq:&nbsp;<!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><!WA161><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs731">CS&nbsp;731</A> or consent of instructor.
(Infrequently offered.)
<A NAME="cs766">&#160;</A>
<H2><A NAME="SECTION000973000000000000000">766 <!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><!WA162><A NAME="tex2html107" HREF="http://www.cs.wisc.edu/~dyer/cs766.html">Computer Vision</A> 3 cr.</A></H2>
<P>
Fundamentals of image analysis and computer vision; image acquisition and
geometry; image enhancement; recovery of physical scene characteristics;
shape-from techniques; segmentation and perceptual organization;
representation and description of two-dimensional and three-dimensional
objects; shape analysis; texture analysis; goal-directed and model-based
systems; parallel algorithms and special-purpose architectures.  
Prereq:&nbsp;<!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><!WA163><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs540">CS&nbsp;540</A>.
<A NAME="cs767">&#160;</A>
<!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><!WA164><A NAME="tex2html108" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000974000000000000000">767 Graph Theory 3 cr.</A></H2>
<P>
Theory of graphs, including adjacency and incidence matrices, planarity,
hamiltonian circuits, Euler's formula, directed graphs, and trees.  The
efficiency of the known algorithms for performing various operations on
graphs.  Prereq:&nbsp;<!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><!WA165><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A> and either <!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><!WA166><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs475">CS&nbsp;475</A> 
or&nbsp;<!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><!WA167><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs577">577</A>, or consent of instructor.  (Infrequently offered.)
<A NAME="cs771">&#160;</A>
<!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><!WA168><A NAME="tex2html109" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000975000000000000000">771 Computational Linguistics 3 cr. (also Ling)</A></H2>
<P>
Tools, techniques and literature of computational linguistics with
applications in artificial intelligence and cognitive science.  Topics include
syntactic and semantic parsing, natural language understanding, text
generation, machine translation, and speech recognition and production.
Prereq:&nbsp;<!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><!WA169><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs540">CS&nbsp;540</A> or&nbsp;<!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><!WA170><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs545">545</A> or Linguistics&nbsp;530 or
consent of instructor.
<A NAME="cs773">&#160;</A><A NAME="cs774">&#160;</A>
<!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><!WA171><A NAME="tex2html110" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000976000000000000000">773-774 Problems in Computational Linguistics 3 cr. per sem. (also Ling)</A></H2>
<P>
Current research in computational linguistics, coupled with original directed
research.  Prereq:&nbsp;<!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><!WA172><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs545">CS&nbsp;545</A> or&nbsp;<!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><!WA173><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs771">771</A> or consent
of instructor.  (Infrequently offered.)
<A NAME="cs780">&#160;</A>
<!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><!WA174><A NAME="tex2html111" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000977000000000000000">780 Robot Motion Planning 3 cr. 
(also ECE &amp; <!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><!WA175><A NAME="tex2html112" HREF="http://www.engr.wisc.edu/me/courses/me780.html">ME)</A></A></H2>
<P>
A unified view on geometric, algorithmic, and computational
issues of automatic motion planning of motion for mobile robots
and arm manipulators in a complex environment. Planning with
complete information - configuration space, connectivity graphs,
computational complexity; with partial information - algorithm
convergence, topological issues. Effect of system kinematics.
Relation between sensing media and algorithm efficiency.
Prereq:&nbsp;Math&nbsp;340 or equivalent and consent of instructor.
<A NAME="cs784">&#160;</A>
<!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><!WA176><A NAME="tex2html113" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000978000000000000000">784 Data Models and Languages 3 cr.</A></H2>
<P>
Study of database programming languages. Topics include: Logic based
languages, embedded query languages, object-oriented languages.  There will be
coverage of types, persistence, inheritance, object identity, data models,
implementation issues, and case studies of actual systems and
languages. Prereq:&nbsp;<!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><!WA177><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs564">CS&nbsp;564</A> and&nbsp;<!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><!WA178><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs536">536</A> or consent
of instructor.
<A NAME="cs787">&#160;</A>
<H2><A NAME="SECTION000979000000000000000">787 <!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><!WA179><A NAME="tex2html114" HREF="http://www.cs.wisc.edu/~condon/cs787.html">Advanced Algorithms and Data Structures</A> 3 cr.</A></H2>
<P>
Algorithms for graph manipulation, geometry, matrix multiplication, string
processing, information retrieval, etc.  Mathematical models and analyses.
Lower bounds.  Probabilistic, distributed, and parallel algorithms.  Advanced
data structures.  Prereq:&nbsp;<!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><!WA180><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs577">CS&nbsp;577</A> or&nbsp;<!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><!WA181><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs509">509</A>.
<A NAME="cs790">&#160;</A>
<!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><!WA182><A NAME="tex2html115" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000980000000000000000">790 Master's Thesis 1-9 cr.</A></H2>
<P>
For students writing a Master's thesis or project.
Prereq:&nbsp;Master's candidate.
<A NAME="cs799">&#160;</A>
<!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><!WA183><A NAME="tex2html116" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000981000000000000000">799 Master's Research 1-9 cr.</A></H2>
<P>
For pre-Master's students doing research projects.
Prereq:&nbsp;Master's candidate.
<A NAME="cs810">&#160;</A>
<H2><A NAME="SECTION000982000000000000000">810 <!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><!WA184><A NAME="tex2html117" HREF="http://www.cs.wisc.edu/~condon/cs810.html">Models and Formalisms for Computation</A> 3 cr.</A></H2>
<P>
Models of computation, Turing machines, recursive functions, Church's thesis,
undecidable problems, degrees of unsolvability.  Denotational semantics, logic
of programs.  Applications to automata, formal languages, program
verification, programming languages, and complexity.  Prereq:&nbsp;<!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><!WA185><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs520">CS&nbsp;520</A>.
<A NAME="cs812">&#160;</A>
<!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><!WA186><A NAME="tex2html118" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000983000000000000000">812 Arithmetic Algorithms 3 cr.</A></H2>
<P>
Design, implementation, and analysis of algorithms for exact arithmetic on
arbitrarily large integers, Gaussian integers and rational numbers.
Algorithms for modular arithmetic and internal arithmetic.  Algorithms for
integer greatest common divisor calculation and factorization.  Classical and
modern algorithms. Prereq:&nbsp;Math&nbsp;541 and <!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><!WA187><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs367">CS&nbsp;367</A>, 
or consent of instructor.
(Infrequently offered.)
<A NAME="cs813">&#160;</A><A NAME="cs814">&#160;</A>
<!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><!WA188><A NAME="tex2html119" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000984000000000000000">813-814 Algebraic Algorithms 3 cr. per sem. (also Math)</A></H2>
<P>
Algorithms for arithmetic operations on multivariate polynomials with
integral, rational and finite field coefficients.  Polynomials remainder
sequences and subresultants.  Algorithms for multivariate polynomial resultant
and greatest common divisor calculation.  Arithmetic operations on
multivariate rational functions.  Algorithms for exact linear algebra of
systems with polynomial coefficients.  Exact calculation of the real and
complex zeros of polynomials.  Algorithms for factorization of polynomials
into irreducibles.  Calculations with real algebraic numbers.  Quantifier
elimination for real closed fields.  Operations on formal power series.
Prereq:&nbsp;<!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><!WA189><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs812">CS&nbsp;812</A> and Math&nbsp;541-542, or consent of instructor.
(Infrequently offered.)
<A NAME="cs815">&#160;</A>
<!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><!WA190><A NAME="tex2html120" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000985000000000000000">815 Transcendental Function Algorithms 3 cr. (also Math)</A></H2>
<P>
Formalism for function class representations; canonical and normal forms;
diophantine sets and relation to recursively enumerable sets; Richardson's
theorem; Lindemann theorems; canonical and normal form algorithms; fundamental
operations on polynomials and rational functions with Gaussian integer
coefficients; fundamental operations on various subclasses of the elementary
transcendental functions; indefinite integration of rational functions;
differential fields; Liouville integration theory; Risch integration
algorithm. Prereq:&nbsp;<!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><!WA191><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs814">CS&nbsp;814</A> or consent of instructor.
(Infrequently offered.)
<A NAME="cs820">&#160;</A>
<!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><!WA192><A NAME="tex2html121" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000986000000000000000">820 Theory of Automata and Formal Languages 3 cr.</A></H2>
<P>
Advanced treatment of results concerning finite automata, regular sets,
context-free and context-sensitive languages, Turing machines.  Extensions of
the models to multi-head, multi-tape, and probabilistic machines.  Comparison
of models.  Applications to programming language design.  Prereq:&nbsp;<!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><!WA193><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs520">CS&nbsp;520</A>.
<A NAME="cs830">&#160;</A>
<!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><!WA194><A NAME="tex2html122" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000987000000000000000">830 Abstract and Concrete Complexity Theory 3 cr.</A></H2>
<P>
Study of computation with limited resources (time, space, etc.).  Complexity
hierarchies, structure of P, NP, PSPACE, co-NP.  Strong NP-completeness,
isomorphism completeness, relativized complexity.  Abstract complexity,
probabilistic complexity.  Lower bounds, time-space tradeoffs, pebbling,
alternation. Prereq:&nbsp;<!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><!WA195><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs520">CS&nbsp;520</A>.
(Infrequently offered.)
<A NAME="cs837">&#160;</A>
<!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><!WA196><A NAME="tex2html123" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000988000000000000000">837 Topics in Numerical Analysis 3 cr. (also Math)</A></H2>
<P>
Topic selected from advanced areas.  A variable content course which may be
repeated any number of times for credit.  Prereq:&nbsp;Consent of instructor.
(Infrequently offered.)
<A NAME="cs838">&#160;</A>
<!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><!WA197><A NAME="tex2html124" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000989000000000000000">838 Topics in Computing 3 cr.</A></H2>
<P>
Topics selected from advanced areas.  A variable content course which may be
repeated any number of times for credit.  Prereq:&nbsp;Consent of instructor.
(Infrequently offered.)
<A NAME="cs880">&#160;</A>
<!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><!WA198><A NAME="tex2html125" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000990000000000000000">880 Topics in Theoretical Computer Science 3 cr.</A></H2>
<P>
Advanced topics in algorithms, complexity, and models of computation,
discussed in a seminar format.  The exact topic varies.  Prereq:&nbsp;consent of
instructor.
(Infrequently offered.)
<A NAME="cs881">&#160;</A><A NAME="cs882">&#160;</A>
<!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><!WA199><A NAME="tex2html126" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000991000000000000000">881-882 Numerical Methods for Ordinary Differential Equations<BR>3 cr. per sem. (also Math)</A></H2>
<P>
Initial-value problems and boundary value problems for systems of nonlinear
ordinary differential equations; convergence and stability of computational
procedures; some topics chosen from the design of general computer programs,
variational problems.  Prereq:&nbsp;<!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><!WA200><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs514">CS&nbsp;514</A> and Math&nbsp;417, or consent of instructor.
(Infrequently offered.)
<A NAME="cs883">&#160;</A><A NAME="cs884">&#160;</A>
<!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><!WA201><A NAME="tex2html127" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000992000000000000000">883-884 Numerical Methods for Partial Differential Equations<BR>3 cr. per sem. (also Math)</A></H2>
<P>
Initial-value problems for systems of partial differential equations; boundary
value problems, stability and convergence; iterative methods; applications to
the classical problems of mathematical
physics. Prereq:&nbsp;<!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><!WA202><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs712">CS&nbsp;712</A> and&nbsp;<!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><!WA203><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs717">717</A>, or consent
of instructor.  (Infrequently offered.)
<A NAME="cs885">&#160;</A>
<!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><!WA204><A NAME="tex2html128" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000993000000000000000">885 Matrix Theory in Numerical Analysis 3 cr. (also Math)</A></H2>
<P>
Methods for determining exclusion and inclusion regions for the eigenvalues of
an <EM>NxN</EM> matrix.  Variational methods for eigenvalues.  The QR and LR
algorithms.  The Perron-Frobenius theory of positive matrices.  Error analysis
of numerical methods for computations in linear algebra.  Prereq:&nbsp;<!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><!WA205><A HREF="http://www.cs.wisc.edu/~pubs/grad-guidebook/node9.html#cs717">CS&nbsp;717</A> or
consent of instructor.
(Infrequently offered.)
<A NAME="cs887">&#160;</A>
<!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><!WA206><A NAME="tex2html129" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000994000000000000000">887 Approximation Theory 3 cr. (also Math)</A></H2>
<P>
Interpolation and approximation by means of interpolation; uniform
approximation; best approximation; approximation in normed linear spaces;
spline functions; orthogonal polynomials; degree of approximation;
computational procedures.  Prereq:&nbsp;Consent of instructor.
<A NAME="cs899">&#160;</A>
<!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><!WA207><A NAME="tex2html130" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000995000000000000000">899 Pre-Dissertator Research 1-9 cr.</A></H2>
<P>
Prereq:&nbsp;Post-Master's, pre-dissertator status.
<A NAME="cs990">&#160;</A>
<!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><!WA208><A NAME="tex2html131" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000996000000000000000">990 Dissertation 1-6 cr.</A></H2>
<P>
Prereq:&nbsp;Dissertator status.
<A NAME="cs999">&#160;</A>
<!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><!WA209><A NAME="tex2html132" HREF=""http://www.cs.wisc.edu/~pubs/grad-guidebook/></A><H2><A NAME="SECTION000997000000000000000">999 Independent Study and Research 1-6 cr.</A></H2>
<P>
Prereq:&nbsp;Dissertator status.
<P>
<H2><A NAME="SECTION000998000000000000000">Non-Credit Seminars</A></H2>
<P>
The nine research areas in the Department each run an advanced, non-credit
seminar where graduate students, visitors, and faculty members from within and
outside the Department present their latest research or discuss recently
published papers.  These seminars give graduate students the opportunity to
learn about current research problems and to get valuable feedback on their
own research.
<P>
Also, each fall the Department runs a Distinguished Lecturer Series where 6-8
leading researchers in a subfield of computer science visit.
The visitors give two lectures - one to a general computer science audience
and a second, more specialized, talk targeted toward researchers in the given
subfield. Recent topics have been programming languages, computing theory,
operating systems, and machine learning.
<P>
<BR> <HR>
<P><ADDRESS>
This page was automatically created.  Send comments to ferris@cs.wisc.edu
</ADDRESS>
</BODY>
</HTML>
